一种广义粗糙集精度的新度量

在粗糙集理论中,精度是量化由粗糙集边界引起的不精确性的一种重要数字特征,但传统精度没有考虑到由关系覆盖导出的颗粒大小。本文通过引入独立邻域集的概念,给出一种新的广义粗糙集精度的度量。     

Generalized rough sets over fuzzy lattices

This paper studies generalized rough sets over fuzzy lattices through both the constructive and axiomatic approaches. From the viewpoint of the constructive approach, the basic properties of generalized rough sets over fuzzy lattices are obtained. The matrix representation of the lower and upper approximations is given. According to this matrix view, a simple algorithm is obtained for computing the lower and upper approximations. As for the axiomatic approach, a set of axioms is constructed to characterize the upper approximation of generalized rough sets over fuzzy lattices.     

Approximations and reducts with covering generalized rough sets

The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In this paper we concentrate our discussion on the above two issues. We first discuss the applied background of covering generalized rough sets by proposing three kinds of datasets which the traditional rough sets cannot handle and improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Then we study the attributes reduct with covering generalized rough sets and present an algorithm by using discernibility matrix to compute all the attributes reducts with covering generalized rough sets. With these discussions we can set up a basic foundation of the covering generalized rough set theory and broaden its applications.     

基于粗糙集理论的属性约简新算法

以属性在可分辨矩阵中出现的频率作为启发,对HORAFA算法做了一些改进。引入二进制可辨识矩阵,利用二进制可辨识矩阵求出相对核。以相对核为基础,依次加入属性重要度大的属性,直到不能再加。     

通用多核并行调试方法研究

多核体系结构加深了并行编程的难度。为开发高效的多核并行调试工具,本文分析了传统并行调试技术面临的问题,提出按并行粒度分级的调试方法,该方法可充分利用并行编程的经验,不断优化调试技术。     

基于相似关系的决策系统的知识获取算法

本文基于一种相似关系下的粗糙集模型,给出了一些基本性质,讨论了该相似关系下的决策系统的知识获取算法。该算法可以避免因数据离散化的处理而产生的信息系统相似度的误差。     

一种新的覆盖粗糙集及其模糊性度量

在覆盖近似空间中定义了一类新的模糊集,给出了该类模糊集的模糊性度量,讨论模糊集及其模糊度量的性质,最后通过实例给出直观解释.     

RS-RBF信息融合在瓦斯监测中的应用研究

针对煤矿单传感器和低层次的多传感器数据处理的单一、不确定性较高的缺点,在对监测信息进行分析、处理、维数压缩后,利用基于粗糙集理论与神经网络相结合的多传感器信息融合技术实现对瓦斯灾害信息的特征提取。通过对瓦斯灾害的辨识分析,获得更准确、更可靠的瓦斯状态信息,极大地提高了瓦斯监测系统的性能,为获得瓦斯灾害变化的一般规律和准确、及时地发布预测信息提供先进的理论和技术支持。     

基于粗糙集的图像感兴趣区域自动提取算法

在分析常规区域生长算法的基础上,提出一种基于粗糙集理论的感兴趣区域自动提取算法．在显著度图和相对位置指示图的基础上,以像素点的显著度、相对位置及颜色信息构成知识表达系统,通过属性约简和值约简,导出了有用的区域生长决策规则。实验结果表明：该方法与现有算法相比,它能够更好地提取图像感兴趣区域。     

基于粗糙集的GMDH神经网络的时间序列预测

针对随机时间序列的强不确定性和非线性特征,结合粗糙集理论和成组数据处理的神经网络技术建立了基于粗集的GMDH神经网络预测模型.同时就自然界大多数的随机时间序列数据维数较大的问题,为提高约简效率,提出了基于快速求核和集合近似质量的约简算法,并进行了仿真验证.结果表明,基于粗集的GMDH神经网络预测模型合理可行,约简算法快速有效.